A prime decomposition theorem for grammatical families
نویسندگان
چکیده
منابع مشابه
Prime Decomposition Theorem for Arbitrary Semigroups: General Holonomy Decomposition and Synthesis Theorem
Herein we generalize the holonomy theorem for finite semigroups (see [7]) to arbitrary semigroups, S, by embedding s^ into an infinite Zeiger wreath product, which is then expanded to an infinite iterative matrix semigroup. If S is not finite-J-above (where finite-J-above means every element has only a finite number of divisors), then S is replaced by g3, the triple Schtitzenberger product, whi...
متن کاملA left part theorem for grammatical trees
We consider a global property of the derivation (or parse) trees of context-free grammars. This property of the derivation trees of context-free grammars can be considered as a restricted version of the left part property for the trees of strict deterministic grammars [3,4,5,6]. In this paper it is shown that this left part property is satisfied by the set of grammatical trees of a left pati gr...
متن کاملA prime factor theorem for bipartite graphs
It has long been known that the class of connected nonbipartite graphs (with loops allowed) obeys unique prime factorization over the direct product of graphs. Moreover, it is known that prime factorization is not necessarily unique in the class of connected bipartite graphs. But any prime factorization of a connected bipartite graph has exactly one bipartite factor. It has become folklore in s...
متن کاملA Decomposition Theorem for Domains
A domain constructor that generalizes the product is de ned. It is shown that with this constructor exactly the prime-algebraic coherent Scott-domains and the empty set can be generated from two-chains and boolean at domains. 3 List of Symbols I am identifying the symbols by the corresponding Latex(+Amssymb)-symbols. " uparrow # downarrow ! rightarrow ? bot > top leq geq 2 in W bigvee V bigwedg...
متن کاملAlgebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
Introduction. In the following all semigroups are of finite order. One semigroup Si is said to divide another semigroup S2, written Si|S2, if Si is a homomorphic image of a subsemigroup of S2. The semidirect product of S2 by Si, with connecting homomorphism Y, is written S2 Xy Si. See Definition 1.6. A semigroup S is called irreducible if for all finite semigroups S2 and Si and all connecting h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1982
ISSN: 0022-0000
DOI: 10.1016/0022-0000(82)90031-9